Logistic regression over encrypted data from fully homomorphic encryption
نویسندگان
چکیده
منابع مشابه
Processing Encrypted Data Using Homomorphic Encryption
Fully Homomorphic Encryption (FHE) was initially introduced as a concept shortly after the development of the RSA cryptosystem, by Rivest et al. [54]. Although long sought after, the first functional scheme was only proposed over thirty years later by Gentry [34, 35] in 2009. The same blueprint to construct FHE has been followed in all subsequent work. First a scheme is constructed which can ev...
متن کاملFully Homomorphic Encryption over the Integers Revisited
Two main computational problems serve as security foundations of current fully homomorphic encryption schemes: Regev’s Learning With Errors problem (LWE) and HowgraveGraham’s Approximate Greatest Common Divisor problem (AGCD). Our first contribution is a reduction from LWE to AGCD. As a second contribution, we describe a new AGCD-based fully homomorphic encryption scheme, which outperforms all ...
متن کاملNew Fully Homomorphic Encryption over the Integers
We first present a fully homomorphic encryption scheme over the integers, which modifies the fully homomorphic encryption scheme in [vDGHV10]. The security of our scheme is merely based on the hardness of finding an approximate-GCD problem over the integers, which is given a list of integers perturbed by the small error noises, removing the assumption of the sparse subset sum problem in the ori...
متن کاملBatch Fully Homomorphic Encryption over the Integers
We extend the fully homomorphic encryption scheme over the integers of van Dijk et al. (DGHV) into a batch fully homomorphic encryption scheme, i.e. to a scheme that supports encrypting and homomorphically processing a vector of plaintexts as a single ciphertext. We present two variants in which the semantic security is based on different assumptions. The first variant is based on a new decisio...
متن کاملFully Homomorphic Encryption over the Integers
We construct a simple fully homomorphic encryption scheme, using only elementary modular arithmetic. We use Gentry’s technique to construct fully homomorphic scheme from a “bootstrappable” somewhat homomorphic scheme. However, instead of using ideal lattices over a polynomial ring, our bootstrappable encryption scheme merely uses addition and multiplication over the integers. The main appeal of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Medical Genomics
سال: 2018
ISSN: 1755-8794
DOI: 10.1186/s12920-018-0397-z